Matching in Semigraph
نویسندگان
چکیده
منابع مشابه
Study on Finite Words in Semigraph Folding
Rudolf Freund studied the splicing systems on graphs and strings. In this paper, with the definition of semigraph folding for the spliced DNA molecule, we characterized the morphic and antimorphic evolution for the alphabet for the folding of spliced semigraph. Also we obtain the set of all properly δlimit words is a totally ordered set with < δ for an antimorphic evolution.
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
Evolutively Finite Words on Semigraph Folding
Rudolf Freund studied the splicing systems on graphs and strings. In this paper, we introduced the definition of semigraph folding for the spliced DNA molecule and shown the result that an nspliced semigraph can be folded onto an edge and two semiedges. On characterization of the morphic and antimorphic evolution for the alphabet for the folding of spliced semigraphs, we obtain the set of all p...
متن کاملThe matching interdiction problem in dendrimers
The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INTERNATIONAL JOURNAL OF COMPUTER APPLICATION
سال: 2017
ISSN: 2250-1797
DOI: 10.26808/rs.ca.i7v6.05